全文获取类型
收费全文 | 127406篇 |
免费 | 15808篇 |
国内免费 | 10671篇 |
专业分类
化学 | 53699篇 |
晶体学 | 851篇 |
力学 | 9393篇 |
综合类 | 2085篇 |
数学 | 51781篇 |
物理学 | 36076篇 |
出版年
2024年 | 130篇 |
2023年 | 1226篇 |
2022年 | 1954篇 |
2021年 | 3403篇 |
2020年 | 3528篇 |
2019年 | 3477篇 |
2018年 | 3139篇 |
2017年 | 3931篇 |
2016年 | 4723篇 |
2015年 | 4086篇 |
2014年 | 6058篇 |
2013年 | 9531篇 |
2012年 | 6925篇 |
2011年 | 7554篇 |
2010年 | 6678篇 |
2009年 | 8166篇 |
2008年 | 8330篇 |
2007年 | 8777篇 |
2006年 | 7424篇 |
2005年 | 6399篇 |
2004年 | 5640篇 |
2003年 | 5167篇 |
2002年 | 4416篇 |
2001年 | 3917篇 |
2000年 | 3290篇 |
1999年 | 2802篇 |
1998年 | 2497篇 |
1997年 | 2264篇 |
1996年 | 1920篇 |
1995年 | 1822篇 |
1994年 | 1601篇 |
1993年 | 1391篇 |
1992年 | 1314篇 |
1991年 | 954篇 |
1990年 | 828篇 |
1989年 | 667篇 |
1988年 | 696篇 |
1987年 | 575篇 |
1986年 | 533篇 |
1985年 | 723篇 |
1984年 | 591篇 |
1983年 | 299篇 |
1982年 | 548篇 |
1981年 | 709篇 |
1980年 | 620篇 |
1979年 | 650篇 |
1978年 | 538篇 |
1977年 | 438篇 |
1976年 | 355篇 |
1973年 | 213篇 |
排序方式: 共有10000条查询结果,搜索用时 152 毫秒
991.
We show that many infinite classes of permutations over finite fields can be constructed via translators with a large choice of parameters. We first characterize some functions having linear translators, based on which several families of permutations are then derived. Extending the results of [9], we give in several cases the compositional inverse of these permutations. The connection with complete permutations is also utilized to provide further infinite classes of permutations. Moreover, we propose new tools to study permutations of the form and a few infinite classes of permutations of this form are proposed. 相似文献
992.
993.
Minh-Ngoc Tran David J. Nott Robert Kohn 《Journal of computational and graphical statistics》2017,26(4):873-882
Variational Bayes (VB) is rapidly becoming a popular tool for Bayesian inference in statistical modeling. However, the existing VB algorithms are restricted to cases where the likelihood is tractable, which precludes their use in many interesting situations such as in state--space models and in approximate Bayesian computation (ABC), where application of VB methods was previously impossible. This article extends the scope of application of VB to cases where the likelihood is intractable, but can be estimated unbiasedly. The proposed VB method therefore makes it possible to carry out Bayesian inference in many statistical applications, including state--space models and ABC. The method is generic in the sense that it can be applied to almost all statistical models without requiring too much model-based derivation, which is a drawback of many existing VB algorithms. We also show how the proposed method can be used to obtain highly accurate VB approximations of marginal posterior distributions. Supplementary material for this article is available online. 相似文献
994.
995.
Paolo Boggiatto Carmen Fernández Antonio Galbis 《Applied and Computational Harmonic Analysis》2017,42(1):65-87
Inspired by results of Kim and Ron, given a Gabor frame in , we determine a non-countable generalized frame for the non-separable space of the Besicovic almost periodic functions. Gabor type frames for suitable separable subspaces of are constructed. We show furthermore that Bessel-type estimates hold for the AP norm with respect to a countable Gabor system using suitable almost periodic norms of sequences. 相似文献
996.
Richard Kueng Holger Rauhut Ulrich Terstiege 《Applied and Computational Harmonic Analysis》2017,42(1):88-116
We study the recovery of Hermitian low rank matrices from undersampled measurements via nuclear norm minimization. We consider the particular scenario where the measurements are Frobenius inner products with random rank-one matrices of the form for some measurement vectors , i.e., the measurements are given by . The case where the matrix to be recovered is of rank one reduces to the problem of phaseless estimation (from measurements ) via the PhaseLift approach, which has been introduced recently. We derive bounds for the number m of measurements that guarantee successful uniform recovery of Hermitian rank r matrices, either for the vectors , , being chosen independently at random according to a standard Gaussian distribution, or being sampled independently from an (approximate) complex projective t-design with . In the Gaussian case, we require measurements, while in the case of 4-designs we need . Our results are uniform in the sense that one random choice of the measurement vectors guarantees recovery of all rank r-matrices simultaneously with high probability. Moreover, we prove robustness of recovery under perturbation of the measurements by noise. The result for approximate 4-designs generalizes and improves a recent bound on phase retrieval due to Gross, Krahmer and Kueng. In addition, it has applications in quantum state tomography. Our proofs employ the so-called bowling scheme which is based on recent ideas by Mendelson and Koltchinskii. 相似文献
997.
Recently, there is a growing interest in the spectral approximation by the Prolate Spheroidal Wave Functions (PSWFs) . This is due to the promising new contributions of these functions in various classical as well as emerging applications from Signal Processing, Geophysics, Numerical Analysis, etc. The PSWFs form a basis with remarkable properties not only for the space of band-limited functions with bandwidth c, but also for the Sobolev space . The quality of the spectral approximation and the choice of the parameter c when approximating a function in by its truncated PSWFs series expansion, are the main issues. By considering a function as the restriction to of an almost time-limited and band-limited function, we try to give satisfactory answers to these two issues. Also, we illustrate the different results of this work by some numerical examples. 相似文献
998.
A tight Heffter array is an matrix with nonzero entries from such that (i) the sum of the elements in each row and each column is 0, and (ii) no element from appears twice. We prove that exist if and only if both m and n are at least 3. If H has the property that all entries are integers of magnitude at most , every row and column sum is 0 over the integers, and H also satisfies ), we call H an integer Heffter array. We show integer Heffter arrays exist if and only if . Finally, an integer Heffter array is shiftable if each row and column contains the same number of positive and negative integers. We show that shiftable integer arrays exists exactly when both are even. 相似文献
999.
In this paper, we consider the online strip packing problem, in which a list of online rectangles has to be packed without overlap or rotation into one or more strips of width 1 and infinite height so as to minimize the required height of the packing. By analyzing a two-phase shelf algorithm, we derive a new upper bound 6.4786 on the competitive ratio for online one strip packing. This result improves the best known upper bound of 6.6623. We also extend this algorithm to online multiple strips packing and present some numeric upper bounds on their competitive ratios which are better than the previous bounds. 相似文献
1000.
We study the convex hull of a set arising as a relaxation of difficult convex mixed integer quadratic programs (MIQP). We characterize the extreme points of the convex hull of the set and the extreme points of its continuous relaxation. We derive four quadratic cutting surfaces that improve the strength of the continuous relaxation. Each of the cutting surfaces is second-order-cone representable. Via a shooting experiment, we provide empirical evidence as to the importance of each inequality type in improving the relaxation. Computational results that employ the new cutting surfaces to strengthen the relaxation for MIQPs arising from portfolio optimization applications are promising. 相似文献